全文获取类型
收费全文 | 15638篇 |
免费 | 1304篇 |
国内免费 | 1155篇 |
专业分类
电工技术 | 571篇 |
技术理论 | 1篇 |
综合类 | 2244篇 |
化学工业 | 678篇 |
金属工艺 | 172篇 |
机械仪表 | 736篇 |
建筑科学 | 1455篇 |
矿业工程 | 321篇 |
能源动力 | 362篇 |
轻工业 | 385篇 |
水利工程 | 422篇 |
石油天然气 | 273篇 |
武器工业 | 63篇 |
无线电 | 898篇 |
一般工业技术 | 1783篇 |
冶金工业 | 723篇 |
原子能技术 | 86篇 |
自动化技术 | 6924篇 |
出版年
2024年 | 16篇 |
2023年 | 96篇 |
2022年 | 182篇 |
2021年 | 233篇 |
2020年 | 331篇 |
2019年 | 338篇 |
2018年 | 321篇 |
2017年 | 426篇 |
2016年 | 514篇 |
2015年 | 514篇 |
2014年 | 1077篇 |
2013年 | 1113篇 |
2012年 | 1240篇 |
2011年 | 1091篇 |
2010年 | 909篇 |
2009年 | 1084篇 |
2008年 | 1095篇 |
2007年 | 1118篇 |
2006年 | 983篇 |
2005年 | 890篇 |
2004年 | 683篇 |
2003年 | 607篇 |
2002年 | 485篇 |
2001年 | 488篇 |
2000年 | 389篇 |
1999年 | 311篇 |
1998年 | 242篇 |
1997年 | 182篇 |
1996年 | 152篇 |
1995年 | 152篇 |
1994年 | 129篇 |
1993年 | 108篇 |
1992年 | 92篇 |
1991年 | 73篇 |
1990年 | 75篇 |
1989年 | 80篇 |
1988年 | 60篇 |
1987年 | 29篇 |
1986年 | 20篇 |
1985年 | 16篇 |
1984年 | 12篇 |
1983年 | 12篇 |
1982年 | 11篇 |
1981年 | 13篇 |
1979年 | 8篇 |
1964年 | 8篇 |
1963年 | 9篇 |
1961年 | 8篇 |
1957年 | 7篇 |
1955年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
The airline industry is a representative industry with high cost and low profitability. Therefore, airlines should carefully plan their schedules to ensure that overall profit is maximized. We review the literature on airline planning and scheduling and focus on mathematical formulations and solution methodologies. Our research framework is anchored on three major problems in the airline scheduling, namely, fleet assignment, aircraft routing, and crew scheduling. General formulation, widely used solution approaches, and important extensions are presented for each problem and integrated problems. We conclude the review by identifying promising areas for further research. 相似文献
32.
We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse. 相似文献
33.
In this paper, we present heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem arising in a real-world situation. In this problem, customers make requests of goods, which are packed in a sortment of boxes. The objective is to find minimum cost delivery routes for a set of identical vehicles that, departing from a depot, visit all customers only once and return to the depot. Apart of the usual 3D container loading constraints which ensure that the boxes are packed completely inside the vehicles and that the boxes do not overlap each other in each vehicle, the problem also takes into account constraints related to the vertical stability of the cargo and multi-drop situations. The algorithms are based on the combination of classical heuristics from both vehicle routing and container loading literatures, as well as two metaheuristic strategies, and their use in more elaborate procedures. Although these approaches cannot assure optimal solutions for the respective problems, they are relatively simple, fast enough to solve real instances, flexible enough to include other practical considerations, and normally assure relatively good solutions in acceptable computational times in practice. The approaches are also sufficiently generic to be embedded with algorithms other than those considered in this study, as well as they can be easily adapted to consider other practical constraints, such as the load bearing strength of the boxes, time windows and pickups and deliveries. Computational tests were performed with these methods considering instances based on the vehicle routing literature and actual customers’ orders, as well as instances based on a real-world situation of a Brazilian carrier. The results show that the heuristics are able to produce relatively good solutions for real instances with hundreds of customers and thousands of boxes. 相似文献
34.
The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time. 相似文献
35.
In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations. 相似文献
36.
Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP. 相似文献
37.
This paper proposes an improved multi-objective differential evolutionary algorithm named multi-objective hybrid differential evolution with simulated annealing technique (MOHDE-SAT) to solve dynamic economic emission dispatch (DEED) problem. The proposed MOHDE-SAT integrates the orthogonal initialization method into the differential evolution, which enlarges the population diversity at the beginning of population evolution. In addition, modified mutation operator and archive retention mechanisms are used to control convergence rate, and simulated annealing technique and entropy diversity method are utilized to adaptively monitor the population diversity as the evolution proceeds, which can properly avoid the premature convergence problem. Furthermore, the MOHDE-SAT is applied on the thermal system with a heuristic constraint handling method, and obtains more desirable results in comparison to those alternatives established recently. The obtained results also reveal that the proposed MOHDE-SAT can provide a viable way for solving DEED problems. 相似文献
38.
Georgios Tsaparlis 《Israel journal of chemistry》2019,59(6-7):478-492
Numerous conceptual difficulties and misconceptions have been reported in the science and chemistry education literature about electrochemistry concepts such as electrolytes, redox equations, and about electrochemical (galvanic and electrolytic) cells. Other studies have considered teaching approaches aimed at improving learning and at overcoming misconceptions. This paper reviews these studies and considers strategies and approaches for the effective teaching of electrochemistry. Then, the review focuses on problem solving in equilibrium electrochemistry, especially problems involving the Nernst equation. The main findings of four studies with Greek university chemistry students, dealing with: (i) algorithmic problem‐solving ability; (ii) practice on problem solving; (iii) the effect of the format of a problem; and (iv) the construction and evaluation of a website devoted to electrochemistry problem solving, are reported. 相似文献
39.
软件功能安全验证活动对提高安全关键系统的安全性具有重要作用,它贯穿于软件安全生命周期的各个阶段。通过对各阶段输出文档的审查和分析,可尽早发现软件问题,降低软件修复成本。完整的问题闭环处理流程可有效解决软件验证活动中发现的问题,给出各方均满意的处理结果。 相似文献
40.
The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field. 相似文献